1 6 O ct 2 00 3 A HASH OF HASH FUNCTIONS
نویسنده
چکیده
In this paper, we present a general review of hash functions in a cryptographic sense. We give special emphasis on some particular topics such as cipher block chaining message authentication code (CBC MAC) and its variants. This paper also broadens the information given in [1], by including more details on block-cipher based hash functions and security of different hash schemes.
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کامل1 0 O ct 2 01 3 On the Insertion Time of Cuckoo Hashing ∗
Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate the random walk heuristic for inserting in an online fashion new items into the hash table. Provided that k ≥ 3 and that the number o...
متن کاملAlgorithmic Techniques for Big Data
Handling an Update: When an update (it, ct) arrives, then ct is added to one entry in each row of the array count. Specifically, ∀1 ≤ j ≤ d, count [j, hj(it)]← count [j, hj(it)] + ct. Lemma 1. The space used by Count-Min Sketch is O(wd) ≡ O( ln 1 δ ) words. Specifically, it uses an array which takes wd words and d hash functions, each of which can be stored using 2 words. An update can be handl...
متن کاملMJH: A Faster Alternative to MDC-2
In this paper, we introduce a new class of double-block-length hash functions. Using the ideal cipher model, we prove that these hash functions, dubbed MJH, are asymptotically collision resistant up to O(2n(1− ) query complexity for any > 0 in the iteration, where n is the block size of the underlying blockcipher. When based on n-bit key blockciphers, our construction, being of rate 1/2, provid...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008